Dominance constraints with Boolean connectives: a model-eliminative treatment
نویسندگان
چکیده
منابع مشابه
Dominance constraints with Boolean connectives: a model-eliminative treatment
Dominance constraints are a language of tree descriptions. Tree descriptions are widely used in computational linguistics for talking and reasoning about trees. While previous research has focused on the conjunctive fragment, we now extend the account to all Boolean connectives and propose a new formalism that combines dominance constraints with a feature tree logic. Although the satisfiability...
متن کاملEliminative Parsing with Graded Constraints
Natural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially totally ambiguous structural representation towards a single interpretation. Graded constraints are used as means to express wellformedness conditions of different strength and to decide which partial structures are locally least preferred and, hence, can be deleted. This approach ...
متن کاملBoolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic (D) called Boolean dependence logic (BD). In BD dependence atoms are of the type =(x1, . . . , xn, α), where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of BD to D and first-orde...
متن کاملSimplifying Formulas of Linear Inequalities with Boolean Connectives
The output of symbolic veriiers and other software with symbolic reasoning capabilities is often itself symbolic and in need of further simpliication for human readability. We present a novel set of tools for simplifying formulas of linear inequalities with Boolean connectives. Our primary focus is the Integer domain (quantiier-free Presburger formulas) but our methodology can also be applied t...
متن کاملOptimization with Stochastic Dominance Constraints
We introduce stochastic optimization problems involving stochastic dominance constraints. We develop necessary and sufficient conditions of optimality and duality theory for these models and show that the Lagrange multipliers corresponding to dominance constraints are concave nondecreasing utility functions. The models and results are illustrated on a portfolio optimization problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00350-4